class Solution {
public:
    int findMin(vector<int>& nums) {
        int n = nums.size();
        int left = 0, right = n - 1;
        while(left < right)
        {
            int mid = left + (right - left) / 2;
            if(nums[mid] > nums[n - 1])
                left = mid + 1;
            else
                right = mid;
        }
        return nums[right];
    }
};
//==============================
class Solution {
public:
    int findMin(vector<int>& nums) {
        int n = nums.size();
        int left = 0, right = n - 1;
        while(left < right)
        {
            int mid = left + (right - left) / 2;
            if(nums[mid] >= nums[0])
                left = mid + 1;
            else
                right = mid;
        }
        return nums[right] > nums[0] ? nums[0] : nums[right];   // 这里要单独判断一下
    }
};